CacBDD: A BDD Package with Dynamic Cache Management
نویسندگان
چکیده
In this paper, we present CacBDD, a new efficient BDD (Binary Decision Diagrams) package. It implements a dynamic cache management algorithm, which takes account of the hit-rate of computed table and available memory. Experiments on the BDD benchmarks of both combinational circuits and model checking show that CacBDD is more efficient compared with the state-of-the-art BDD package CUDD.
منابع مشابه
Bdd Algorithms and Cache Misses Draft
Within the last few years, CPU speed has greatly overtaken memory speed. For this reason, implementation of symbolic algorithms|with their extensive use of pointers and hashing|must be reexamined. In this paper, we introduce the concept of cache miss complexity as an analytical tool for evaluating algorithms depending on pointer chasing. Such algorithms are typical of symbolic computation found...
متن کاملBDD Algortihms and Cache Misses
Within the last few years, CPU speed has greatly overtaken memory speed. For this reason, implementation of symbolic algorithms— with their extensive use of pointers and hashing—must be reexamined. In this paper, we introduce the concept of cache miss complexity as an analytical tool for evaluating algorithms depending on pointer chasing. Such algorithms are typical of symbolic computation foun...
متن کاملBDDNOW: A Parallel BDD Package
BDDs (binary decision diagrams) are ubiquitous in formal verificationtools, and the time and memory used by the BDD package is frequently the con-straint that prevents application of formal verification. Accordingly, several re-searchers have investigated using parallel processing for BDDs. In this paper, wepresent a parallel BDD package with several novel features. The parallel...
متن کاملImplementation and Visualization of a BDD Package in JAVA
Decision Diagrams (DDs) are often used in VLSI CAD systems for efficient representation and manipulation of Boolean functions. The most popular data structure are reduced ordered Binary Decision Diagrams (BDDs) [Bry86,DB98], also called ROBDDs. They are part of almost all courses on function representation in VLSI CAD education. BDDs are very sensitive to the variable ordering, i.e. the size of...
متن کاملDynamic Reordering in a Breadth-First Manipulation Based BDD Package: Challenges and Solutions
The breadth-rst manipulation technique has proven eeective in dealing with very large sized BDDs. However , till now the lack of dynamic variable reordering has remained an obstacle in its acceptance. The goal of this work is to provide eecient techniques to address this issue. After identifying the problems with implementing variable swapping (the core operation in dynamic reordering) in bread...
متن کامل